package cn.wolfcode.luowowo.article.query;

import lombok.Getter;

import java.util.HashMap;
import java.util.Map;


@Getter
public class TravelCondition {
    //天数
    public static final Map<Integer, TravelCondition> DAYS_MAP = new HashMap<>();
    //旅游出发月份
    public static final Map<Integer, TravelCondition> TRAVEL_TIME = new HashMap<>();
    //花费
    public static final Map<Integer, TravelCondition> TRAVEL_PRE_EXPENDS = new HashMap<>();

    static {
        //天数
        DAYS_MAP.put(1, new TravelCondition(0, 3));
        DAYS_MAP.put(2, new TravelCondition(4, 7));
        DAYS_MAP.put(3, new TravelCondition(8, 14));
        DAYS_MAP.put(4, new TravelCondition(15, Integer.MAX_VALUE));

        //旅游出发月份
        TRAVEL_TIME.put(-1, new TravelCondition(1, 12));
        TRAVEL_TIME.put(1, new TravelCondition(1, 2));
        TRAVEL_TIME.put(2, new TravelCondition(3, 4));
        TRAVEL_TIME.put(3, new TravelCondition(5, 6));
        TRAVEL_TIME.put(4, new TravelCondition(7, 8));
        TRAVEL_TIME.put(5, new TravelCondition(9, 10));
        TRAVEL_TIME.put(6, new TravelCondition(11, 12));

        //花费
        TRAVEL_PRE_EXPENDS.put(1, new TravelCondition(1, 999));
        TRAVEL_PRE_EXPENDS.put(2, new TravelCondition(1000, 6000));
        TRAVEL_PRE_EXPENDS.put(3, new TravelCondition(6001, 200000));
        TRAVEL_PRE_EXPENDS.put(4, new TravelCondition(200001,Integer.MAX_VALUE));
    }


    private int min;
    private int max;

    public TravelCondition(int min, int max) {
        this.min = min;
        this.max = max;
    }

}
